A Mathematical Programming Algorithm for Planning and Scheduling an Earth Observing SAR Constellation
نویسندگان
چکیده
We consider the planning and scheduling problem of the COSMO-SkyMed constellation for the observation of the Earth. We define a simplified problem which only takes into account the most binding constraints of the real problem. We present a Lagrangean relaxation algorithm that provides upper bounds and we show that it can also be used to guide an existing heuristic algorithm to find better solutions to the real
منابع مشابه
Scheduling a constellation of agile earth observation satellites with preemption
In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...
متن کاملMulti-objective mission planning problem of agile Earth observing satellites
In this paper, we concern multi-objective mission planning problem of a constellation of the next generation agile Earth-observing satellites. As usual, the goal of Earth-observing satellite mission planning is to maximize the sum weights of selected tasks. But for agile satellites, based on its stronger ability, single criterion is often a poor measure of planning results. For agile satellite,...
متن کاملMaximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm
The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important...
متن کاملA Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes
In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کاملPlanning in a cross dock network with an operational scheduling overview
Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006